Accelerated failure time models with log-concave errors
نویسندگان
چکیده
منابع مشابه
G-estimation for Accelerated Failure Time Models
There is an increasing interest in life-course epidemiology (Ben-Shlomo 2007; Ben-Shlomo and Kuh 2002), with the quantification of the effects of exposures over long periods of time. For example, several papers recently have examined the effects of socioeconomic position at different stages of life, and changes in that exposure between these stages, on outcomes including risk of stroke and resp...
متن کاملSurvival analysis of thalassemia major patients using Cox, Gompertz proportional hazard and Weibull accelerated failure time models
Background: Thalassemia major (TM) is a severe disease and the most common anemia worldwide. The survival time of the disease and its risk factors are of importance for physicians. The present study was conducted to apply the semi-parametric Cox PH model and use parametric proportional hazards (PH) and accelerated failure time (AFT) models to identify the risk factors related to survival of TM ...
متن کاملRegularity for a Log-concave to Log-concave Mass Transfer Problem with near Euclidean Cost
If the cost function is not too far from the Euclidean cost, then the optimal map transporting Gaussians restricted to a ball will be regular. Similarly, given any cost function which is smooth in a neighborhood of two points on a manifold, there are small neighborhoods near each such that a Gaussian restricted to one is transported smoothly to a Gaussian on the other.
متن کاملClustering with mixtures of log-concave distributions
The EM algorithm is a popular tool for clustering observations via a parametric mixture model. Two disadvantages of this approach are that its success depends on the appropriateness of the assumed parametric model, and that each model requires a different implementation of the EM algorithm based on model-specific theoretical derivations. We show how this algorithm can be extended to work with t...
متن کاملGraph products with log-concave independence polynomials
A stable set in a graph G is a set of pairwise non-adjacent vertices. The independence polynomial of G is I(G;x) = s0+s1x+s2x 2 +...+sαx α , where α = α(G) is the cardinality of a maximum stable of G, while sk equals the number of stable sets of size k in G (Gutman and Harary, 1983). Hamidoune, 1990, showed that for every claw-free graph G (i.e., a graph having no induced subgraph isomorphic to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Econometrics Journal
سال: 2019
ISSN: 1368-4221,1368-423X
DOI: 10.1093/ectj/utz024